Definition

k(⋅,⋅)k(\cdot, \cdot) is a reproducing kernel of a Hilbert space ℋ\mathcal{H} if ∀f∈ℋ\forall f \in \mathcal{H}, f(x)=⟨k(x,⋅),f(⋅)⟩f(x) = \langle k(x,\cdot),f(\cdot)\rangle.

A reproducing kernel Hilbert space (RKHS) is a Hilbert space HH with a reproducing kernel whose span is dense in HH.

Or equivalently, RKHS is a Hilbert space of functions with all evaluation functionals bounded and linear.

(continuous evaluation functional)

For a (compact) 𝒳⊆ℝd\mathcal{X} \subseteq \mathbb{R}^d, and a Hilbert space ℋ\mathcal{H} of functions f:𝒳→ℝf : \mathcal{X} \to \mathbb{R}, say ℋ\mathcal{H} is a reproducing kernel Hilbert space if ∃k:𝒳→ℝ\exists k : \mathcal{X} \to \mathbb{R} such that

  • kk has the reproducing property (kernel trick)
    • i.e. ∀x∈𝒳,∀f(⋅)∈ℋ,f(x)=⟨k(x,⋅),f(⋅)⟩\forall x \in \mathcal{X}, \forall f(\cdot) \in \mathcal{H}, f(x) = \langle k(x,\cdot),f(\cdot)\rangle (or shorter notation ⟨f,ϕ(x)⟩ℋ\langle f, \phi(x) \rangle_\mathcal{H})
  • kk spans ℋ=span⁡{k(⋅,x):x∈𝒳}\mathcal{H}=\overline{\operatorname{span}\{k(\cdot,x) : x \in \mathcal{X}\}}

Notes

  • role in kernelized gradient descent
  • the reproducing kernel k:𝒳×𝒳→ℝk : \mathcal{X} \times \mathcal{X} \to \mathbb{R} may be a kernel if it is symmetric and positive semidefinite (i.e. its Gram matrix Kij=k(xi,xj)K_{ij} = k(x_i,x_j) is positive semidefinite)
  • Mercer's theorem may be used to characterize symmetrpic positive semidefinite kernel

References

  1. https://people.eecs.berkeley.edu/~bartlett/courses/281b-sp08/7.pdf
  2. https://www.gatsby.ucl.ac.uk/~gretton/coursefiles/lecture4_introToRKHS.pdf
  3. http://mlss.tuebingen.mpg.de/2015/slides/gretton/part_1.pdf
  4. https://oneweirdkerneltrick.com/
  5. https://teazrq.github.io/SMLR/reproducing-kernel-hilbert-space.html